Optimal scheduling of progressive processing tasks
نویسندگان
چکیده
منابع مشابه
Optimal scheduling of progressive processing tasks
Progressive processing is an approximate reasoning model that allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a prede®ned hierarchical task structure. It is a useful model for a variety of real-time tasks such as information retrieval, automated diagnosis, or real-time image tracking and speech recognition. In...
متن کاملOptimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchical task structure. It is a useful model for a variety of real-time AI tasks such as diagnosis and planning in which it is necessary to trade-off computational resources for quality of results. This paper addresses pro...
متن کاملDynamic Scheduling of Progressive Processing Plans
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When the structure of a plan is known in advance, it can be optimally scheduled by solving a corresponding Markov decision process. This paper extends this approach to dynamic scheduling of plans that can be constantly mod...
متن کاملOptimal Scheduling of Periodic Tasks on Multiple Identical Processors
We consider the problem of scheduling m periodic tasks on n; n < m; identical processors. Our main contribution is to show that the condition n, where is the total density of the task set, is a suucient condition for scheduling the m tasks such that no deadlines are ever missed. We start with a novel representation of the periodic task scheduling problem as a maximum network ow problem. The str...
متن کاملOptimal Scheduling of Imprecise Computation Tasks in the Presence
With the advance of applications such as multimedia, imagelspeech processing and real-time AI, real-time computing models allowing to express the “timeliness versus precision” trade-off are becoming increasingly popular. In the Imprecise Computation model, a task is divided into a mandatory part and an optional part. The mandatory part should be completed by the deadline even under worst-case s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2000
ISSN: 0888-613X
DOI: 10.1016/s0888-613x(00)00049-9